Specifying Admissibility of Dynamic Database Behaviour
نویسندگان
چکیده
This work uses temporal logic as a calculus for expressing integrity constraints that specify admissibility of dynamic database behaviour. Formulas are interpreted in state sequences representing dynamic behaviour. Our approach incorporates temporal quantification by 11 always 11 , 11 sometime 11 , and quantifiers bounded by intervals in state sequences. Moreover, dynamically changing domains of database values are considered. We then use special kinds of formulas as a language for dynarnie constraints and give some hints how to specify in typical situations. For such formulas, a frame for monitoring constraints during runtime of a database is discussed which allows to characterize admissibility operationally.
منابع مشابه
Using Finite-Linear Temporal Logic for Specifying Database Dynamics
The specification of a database system consists of the description of its static information structure as well as of its dynamic behaviour. Whereas in classic conceptual database design the main interest was on the static part, specification of database dynamics became an important topic in the last few years. The specification of dynamic database behaviour has to describe the correct evolution...
متن کاملMonitoring Dynamic Integrity Constraints on Finite State Sequences and Existence Intervals
Correct database behaviour in the course of time can be specified by requiring dynamic integrity constraints. These constraints can be expressed as temporal logic formulae which, however, usually are interpreted in infinite state sequences. Since in practice only a partial, finite prefix of an infinite sequence is known, notions of partial admissibility of finite sequences with respect to const...
متن کاملExtending Temporal Logic for Capturing Evolving Behaviour
The known approaches to object speciication based on rst-order temporal logic fail in capturing the often occurring need to change the dynamic behaviour of a system during lifetime of that system. Usually all possible behaviours have to be described in advance, i.e. at spec-iication time. Therefore, we here present an extension going beyond rst-order temporal logic. Now, it becomes possible to ...
متن کاملSpecifying Evolving Temporal Behaviour
The usual approaches to object speciication based on rst-order temporal logic fail in capturing the often occurring need to change the dynamic behaviour of a system during lifetime of that system. Usually all possible behaviours have to be described in advance, i.e. at speciication time. Therefore, we here present an extension going beyond rst-order temporal logic. Now, it becomes possible to s...
متن کاملOn the Lie-Santilli Admissibility
The largest class of hyperstructures is the one which satisfies the weak properties. We connect the theory of P-hopes, a large class of hyperoperations, with the Lie-Santilli admissibility used in Hardonic Mechanics. This can be achieved by a kind of Ree, sandwich hyperoperation.
متن کامل